Utility Accrual Real-Time Scheduling with Probabilistically-Assured Timeliness Performance
نویسندگان
چکیده
We present time/utility function (TUF) algorithms that provide probabilistic assurance on timeliness behavior. A TUF, which is a generalization of the classical deadline constraint, specifies the utility of completing an application activity as a function of that activity’s completion time. The algorithms consider a stochastic model where activity execution times and arrivals are probabilistically described. Further, activity time constraints are specified using TUFs. We consider the dual optimization objective of probabilistically satisfying applicationspecified lower bounds on individual activity utility, and maximizing system-wide total utilities. We present algorithms that achieve this dual objective.
منابع مشابه
The Case for TUFs and UA Scheduling in RT UML Profile: A Real-Time Scheduling/Operating System Perspective
This position paper makes the case for incorporating time/utility functions (TUFs) and the paradigm of utility accrual real-time scheduling in the planned, updated version of the UML Profile for Schedulability, Performance, and Time. The case is made by arguing that the key underpinning of the current state-of-the real-time practice — the priority artifact — and that of the current state-of-the...
متن کاملUtility Accrual Real-Time Scheduling with Energy Bounds
In this paper, we consider timeliness and energy optimization in battery-powered, dynamic embedded real-time systems, which must remain functional during an operation/mission with a bounded energy budget. We consider application activities that are subject to time/utility function time constraints, statistical assurance requirements on timeliness behavior, and an energy budget, which cannot be ...
متن کاملGarbage Collection Scheduling for Utility Accrual Real-Time Systems
Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand e...
متن کاملOn Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model includes tasks with time/utility function time constraints, mutual exclusion constraints, and arbitrary arrival, execution-time and resource access behaviors, with the timeliness optimization objective of maximizing the...
متن کاملUtility Accrual Scheduling under Arbitrary Time/Utility Functions and Multi-unit Resource Constraints
We present a uni-processor real-time scheduling algorithm called Resource-contrainted Utility Accrual algorithm (or RUA). RUA considers an application model, where activities can be subject to arbitrarily-shaped time/utility function (TUF) time constraints and resource constraints including mutual exclusion under a multi-unit resource request model. For such a model, we consider the scheduling ...
متن کامل